منابع مشابه
Collusion with Capacity Constraints over the Business Cycle
This paper investigates the effect of capacity constraints on the sustainability of collusion in markets subject to cyclical demand fluctuations. In the absence of capacity constraints (i.e. a limiting case of our model), Haltiwanger and Harrington (1991) show that firms find it more difficult to collude during periods of decreasing demand. We find that this prediction can be overturned if firm...
متن کاملOligopoly with Capacity Constraints and Thresholds
Abstract Extended Oligopoly models will be introduced and examined in which the firms might face capacity limits, thresholds for minimal and maximal moves, and antitrust thresholds in the case of partial cooperation. Similar situation occurs when there is an additional cost of output adjustment, which is discontinuous at zero due to set-up costs. In these cases the payoff functions of the...
متن کاملTacit Collusion in a Dynamic Duopoly with Indivisible Production and Cumulative Capacity Constraints
This paper studies a dynamic, quantity setting duopoly game characterized as follows: Each firm produces an indivisible output over a potentially infinite horizon, facing the constraint that its cumulative production cannot exceed an initially given bound. The environment is otherwise stationary; the remaining productive capacities of the firms at any moment are common knowledge; the firms choo...
متن کاملHub Covering Location Problem Considering Queuing and Capacity Constraints
In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...
متن کاملDesign and Analysis of High-Capacity Anti-Collusion Hiding Codes
A new methodology for the design of high-capacity anti-collusion hiding codes in a large-scale fingerprint-based traitor tracing system is proposed in this work. We consider a hiding code of MN bits, where M bits are used as the user ID and N bits are the length of the spreading codes. Since each user is assigned one out of 2 ID numbers and one out of N spreading codewords, the total number of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Southern Economic Journal
سال: 1992
ISSN: 0038-4038
DOI: 10.2307/1060235